Contextual Feature Constrained Semantic Face Completion With Paired Discriminator

نویسندگان

چکیده

Image semantic completion is to employ remaining image information restore the damaged or missing areas. Face task usually more challenging than other inpainting problems as it requires stronger consistency. We proposed a contextual feature constrained DCGAN with paired discriminator inpaint face images, which capable of overcoming DCGAN's shortages insufficient learning capability and unstable training process. Our network composed an encoder-decoder generator local global (paired) adversarial discriminator. Generator used produce parts, discriminators evaluate authenticity generated parts consistency completed respectively. In addition, generates by optimizing three types loss functions, i.e., reconstruction loss, matching losses losses. The experiments on celebA Stanford Cars dataset show that our model could generate reasonable repair results some evaluation indicators were higher baseline most test datasets.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contextual Patch Feature Learning for Face Recognition

Local features, such as local binary patterns (LBP), have shown better performance than global feature in the problem of face recognition. However, the methods to extract the local features are usually given as fixed, and also neglect the class labels of the training samples. In this paper, we propose a novel algorithm to learn a discriminate local feature from the small patches of the face ima...

متن کامل

Automatic Extension of Feature-based Semantic Lexicons via Contextual Attributes

We describe how a feature-based semantic lexicon can be automatically extended using large, unstructured text corpora. Experiments are carried out using the lexicon HaGenLex and the Wortschatz corpus. The semantic classes of nouns are determined via the adjectives that modify them. It turns out to be reasonable to combine several classifiers for single attributes into one for complex semantic c...

متن کامل

Contextual Recommendation with Path Constrained Random Walks

Recommendation has become an increasingly important research area because of the abundance of online documents and shopping opportunities. The readily available context information for these tasks posts challenges to recommendation systems to deal with heterogeneous and inter-connected problem spaces. In this study, we use a graph representation for publication databases with rich meta-data. Wi...

متن کامل

Active Feature Acquisition with Supervised Matrix Completion

Feature missing is a serious problem in many applications, which may lead to low quality of training data and further significantly degrade the learning performance. While feature acquisition usually involves special devices or complex process, it is expensive to acquire all feature values for the whole dataset. On the other hand, features may be correlated with each other, and some values may ...

متن کامل

Redundancy Criteria for Constrained Completion

This paper studies completion in the case of equations with constraints consisting of rstorder formulae over equations, disequations, and an irreducibility predicate. We present several inference systems which show in a very precise way how to take advantage of redundancy notions in this framework. A notable feature of these systems is the variety of tradeo s they present for removing redundant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2021

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2021.3065661